0.00/0.01	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : fo
0.00/0.01	% Ordering    : kbo
0.00/0.01	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-ho \
0.00/0.01	  --no-avatar \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2 \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --no-fool
0.00/0.19	% Computer   : n184.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 17:12:40 CST 2018
0.00/0.20	% done 7 iterations in 0.003s
0.00/0.20	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.20	% SZS output start Refutation
0.00/0.20	tff(notsubsetI, conjecture,
0.00/0.20	  (subsetE => (![A,B,Xx]: (in(Xx,A) => ((~in(Xx,B)) => (~subset(A,B))))))).
0.00/0.20	tff(zf_stmt_0, negated_conjecture,
0.00/0.20	  (~(subsetE => (![A,B,Xx]: (in(Xx,A) => ((~in(Xx,B)) => (~subset(A,B)))))))).
0.00/0.20	tff('0', plain, subset(sk_A1, sk_B1),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff(subsetE, axiom,
0.00/0.20	  (subsetE <=> (![A,B,Xx]: (subset(A,B) => (in(Xx,A) => in(Xx,B)))))).
0.00/0.20	tff('1', plain,
0.00/0.20	    ![X0, X1, X2]: (~ in(X0, X1) | in(X0, X2) | ~ subset(X1, X2) | ~ subsetE),
0.00/0.20	    inference('cnf', [status(esa)], [subsetE])).
0.00/0.20	tff('2', plain, subsetE, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('3', plain,
0.00/0.20	    ![X0, X1, X2]: (~ in(X0, X1) | in(X0, X2) | ~ subset(X1, X2) | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['1', '2'])).
0.00/0.20	tff('4', plain,
0.00/0.20	    ![X0, X1, X2]: (~ subset(X1, X2) | in(X0, X2) | ~ in(X0, X1)),
0.00/0.20	    inference('simplify', [status(thm)], ['3'])).
0.00/0.20	tff('5', plain, ![X0]: (~ $true | ~ in(X0, sk_A1) | in(X0, sk_B1)),
0.00/0.20	    inference('sup-', [status(thm)], ['0', '4'])).
0.00/0.20	tff('6', plain, ![X0]: (in(X0, sk_B1) | ~ in(X0, sk_A1)),
0.00/0.20	    inference('simplify', [status(thm)], ['5'])).
0.00/0.20	tff('7', plain, ~ in(sk_Xx1, sk_B1),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('8', plain, (~ $true | ~ in(sk_Xx1, sk_A1)),
0.00/0.20	    inference('sup-', [status(thm)], ['6', '7'])).
0.00/0.20	tff('9', plain, in(sk_Xx1, sk_A1),
0.00/0.20	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.20	tff('10', plain, (~ $true | ~ $true),
0.00/0.20	    inference('demod', [status(thm)], ['8', '9'])).
0.00/0.20	tff('11', plain, $false, inference('simplify', [status(thm)], ['10'])).
0.00/0.20	
0.00/0.20	% SZS output end Refutation
0.00/0.21	EOF
